Graph-Based Models of Internetworking Systems

نویسندگان

  • Gian Luigi Ferrari
  • Ugo Montanari
  • Emilio Tuosto
چکیده

Graphical notations have been widely accepted as an expressive and intuitive working tool for system specification and design. This paper outlines a declarative approach based on (hyper-)graphs and graph synchronization to deal with the modeling of Wide Area Network applications. This paper aims at contributing to the understanding of crucial issues involved in the specification and design of Wide Area Network systems, as a first step toward the development of software engineering techniques and tools for designing and certificating internetworking systems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generation and Analysis of Random Graphs to Model Internetworks

Graph models are commonly used in studying solutions to internetworking problems. This paper considers several random graph models that have been used to model internetworks, and considers ways to characterize the properties of these graphs. By matching the characteristics of the random graphs to the characteristics of real internetworks, more accurate modeling can be achieved.

متن کامل

Secure Communication in Shotgun Cellular Systems

In this paper, we analyze the secure connectivity in Shotgun cellular systems (SCS: Wireless communication systems with randomly placed base stations) by Poisson intrinsically secure communication graph (IS-graph), i.e., a random graph which describes the connections that are secure over a network. For a base-station in SCS, a degree of secure connections is determined over two channel models: ...

متن کامل

ON THE MATCHING NUMBER OF AN UNCERTAIN GRAPH

Uncertain graphs are employed to describe graph models with indeterministicinformation that produced by human beings. This paper aims to study themaximum matching problem in uncertain graphs.The number of edges of a maximum matching in a graph is called matching numberof the graph. Due to the existence of uncertain edges, the matching number of an uncertain graph is essentially an uncertain var...

متن کامل

Engineering multimedia systems using multimedia internetworking and Actors

Complexity in developing multimedia systems in heterogeneous environments like Internet demands for customizable toolkits and frameworks which integrate multimedia networking protocols and application models. This paper proposes a component-based approach to engineer distributed multimedia systems which centers on lightweight actors and on the Internet multimedia protocol stack. A multimedia sy...

متن کامل

A Novel Molecular Descriptor Derived from Weighted Line Graph

The Bertz indices, derived by counting the number of connecting edges of line graphs of a molecule were used in deriving the QSPR models for the physicochemical properties of alkanes. The inability of these indices to identify the hetero centre in a chemical compound restricted their applications to hydrocarbons only. In the present work, a novel molecular descriptor has been derived from the w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002